Allocation adaptative de registres en utilisant un nombre linéaire de registres

نویسندگان

  • Carole Delporte-Gallet
  • Hugues Fauconnier
  • Eli Gafni
  • Leslie Lamport
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A New Fast Algorithm for Optimal Register Allocation in Modulo Scheduled Loops

In this paper, we focus on the register allocation phase of software pipelining. We are interested in optimal register allocation. This means that the number of registers used must be equal to the maximum number of simultaneously alive variables of the loop. Usually two diierent means are used to achieve this, namely register renaming or loop unrolling. As these methods have both drawbacks, we ...

متن کامل

A Tiling Perspective for Register Optimization

Register allocation is a much studied problem. A particularly important context for optimizing register allocation is within loops, since a significant fraction of the execution time of programs is often inside loop code. A variety of algorithms have been proposed in the past for register allocation, but the complexity of the problem has resulted in a decoupling of several important aspects, in...

متن کامل

Allocating registers in multiple instruction-issuing processors

This work addresses the problem of scheduling a basic block of operations on a multiple instruction-issuing processor. We show that integrating register constraints into operation sequencing algorithms is a complex problem in itself. Indeed, while scheduling a forest of unit time operations on a processor with P parallel instruction slots can be solved in polynomial time, the problem becomes NP...

متن کامل

Exploration implicite et explicite de l'espace d''etats atteignables de circuits logiques Esterel

ion basée sur la profondeur des variables d’états Une première idée pour automatiser la sélection des variables à abstraire est d’utiliser la profondeur des variables d’états. Cette profondeur correspond au nombre de variables d’état sur le plus court chemin entre la variable d’état candidate à l’abstraction et les sorties des propriétés à vérifier. Cette profondeur se calcule pour l’ensemble d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017